Recursive Mappings and the Complexity Catastrophes
نویسنده
چکیده
Recursive mappings such as Lindenmeyer systems have been proposed as a model of some aspects of the morphogenic process. In this paper one such mapping, the M-system, is introduced and compared with an iterative system, the Random Boolean Networks described by Kauuman. There are fundamental diierences in the statistical properties of these two systems, especially in their behaviour as system complexity increases.
منابع مشابه
Low Complexity and High speed in Leading DCD ERLS Algorithm
Adaptive algorithms lead to adjust the system coefficients based on the measured data. This paper presents a dichotomous coordinate descent method to reduce the computational complexity and to improve the tracking ability based on the variable forgetting factor when there are a lot of changes in the system. Vedic mathematics is used to implement the multiplier and the divider in the VFF equatio...
متن کاملCell Biology: Networks, Regulation and Pathways
Lu JC (1976) Singularity theory with an introduction to catastrophe theory. Springer, Berlin Majthay A (1985) Foundations of catastrophe theory. Pitman, Boston Mather JN (1969) Stability of C1-mappings. I: Annals Math 87:89– 104; II: Annals Math 89(2):254–291 Poston T, Stewart J (1976) Taylor expansions and catastrophes. Pitman, London Stewart I (1977) Catastrophe theory. Math Chronicle 5:140–1...
متن کاملA Heuristic Algorithm for Project Scheduling Problem to Maximizing the Net Present Value
This paper deals with resource unconstrained project scheduling problems with the objective of maximizing the net present value (NPV) of project cash flows. Here we present a heuristic algorithm named as differential procedure (Dif_AOA).
In order to evaluate the efficiency of this algorithm, networks with node numbers between 10-1000 and network complexity coefficients between 1.3-6.6 have ...
متن کاملA Heuristic Algorithm for Project Scheduling Problem to Maximizing the Net Present Value
This paper deals with resource unconstrained project scheduling problems with the objective of maximizing the net present value (NPV) of project cash flows. Here we present a heuristic algorithm named as differential procedure (Dif_AOA). In order to evaluate the efficiency of this algorithm, networks with node numbers between 10-1000 and network complexity coefficients between 1.3-6.6 have be...
متن کاملEcological stability and complexity : Is itnecessarily catastrophic ?
It has been shown that many ecological systems exhibit a degree of stability and complexity which is above that predicted by current theoretical models. The early works of Gardner & Ashby and May have suggested that a catastrophic decrease in stability occurs as system size and connectance increases above a threshold value. A similar model, the NK model, developed by Kauuman also shows a simila...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997